Every Rational Number is Approximable to no Order Greater Than 1

Theorem

Every rational number is approximable to order 1 and no greater.

Proof

Since every real number is approximable to order one, we just need to prove that each rational number is approximable to no higher order. Suppose α=ab is a rational number, with a,bZ and b>0. Then, for each p,qZ with q>0 consider that

|αpq|=|aqbpbq|=|aqbp|bq.

If we assume αpq, then the numerator aqbp is non-zero. Since it is a positive integer, it must be at least 1 and therefore

|αpq|=|aqbp|bq1bq.

Now, assume that α is approximable to some order s. Thus, using the above inequality as well, there exists a c such that, for pairs (p,q) with arbitrarily large q we have

1bq≤=|aqbp|bq<cqs.

Therefore

qs1=qsq<bc.

Since neither b nor c depend on q, the only way this can be true for arbitrarily large q is if s10, or equivalently that s1. Thus, α is approximable to no order greater than 1.